On linearly ordered groups.
نویسندگان
چکیده
منابع مشابه
Linearly Ordered Topological Spaces
This work is devoted to the study of certain cardinality modifications of paracompactness and compactness in the setting of linearly ordered spaces. Some of the concepts treated here have previously been studied by Aquaro [l]1, Gulden [4], Kennison [5], Mansfield [6], Morita [7], and Poppe [9]. On the other hand, the concept of m-boundedness, introduced in §2, is new. Our main results (Theorems...
متن کاملOn Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference relation on extended literals. This relation, a strict partial order, induces a partial order on extended answer sets. The preferred answer sets, i.e. those that are minimal w.r.t. the induced order, represent the solutio...
متن کاملOn Ordered Polycyclic Groups
It has been asserted that any (full) order on a torsion-free, finitely generated, nilpotent group is defined by some F-basis of G and that the group of o-automorphisms of such a group is itself a group of the same kind: Examples provided herein demonstrate that both of these assertions are false; however, it is proved that the group of o-automorphisms of an ordered, polycyclic group is nilpoten...
متن کاملA Note on Point-countability in Linearly Ordered Spaces
In this note linearly ordered topological spaces (abbreviated LOTS) with a point-countable base are examined. It is shown that a LOTS is quasi-developable if and only if it has a <r-point-finite base and a LOTS with a point-countable base is paracompact. An example of a LOTS with a point-countable base that does not have a <r-point-finite base is given. Conditions are given for the metrizabilit...
متن کاملParsing Using Linearly Ordered Phonological Rules
A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing algorithm would face by encoding into the form being parsed the ambiguities which arise during parsing. The algorithm has been implemented and tested on real langua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 1948
ISSN: 0025-5645
DOI: 10.2969/jmsj/00110001